Lifted generalized permutahedra and composition polynomials
نویسندگان
چکیده
منابع مشابه
Lifted generalized permutahedra and composition polynomials
We introduce a “lifting” construction for generalized permutohedra, which turns an n-dimensional generalized permutahedron into an (n + 1)-dimensional one. We prove that this construction gives rise to Stasheff’s multiplihedron from homotopy theory, and to the more general “nestomultiplihedra,” answering two questions of Devadoss and Forcey. We construct a subdivision of any lifted generalized ...
متن کاملPermutahedra and Generalized Associahedra
Given a finite Coxeter system (W,S) and a Coxeter element c, or equivalently an orientation of the Coxeter graph of W , we construct a simple polytope whose outer normal fan is N. Reading’s Cambrian fan Fc, settling a conjecture of Reading that this is possible. We call this polytope the c-generalized associahedron. Our approach generalizes Loday’s realization of the associahedron (a type A c-g...
متن کاملLifted Generalized Dual Decomposition
Many real-world problems, such as Markov Logic Networks (MLNs) with evidence, can be represented as a highly symmetric graphical model perturbed by additional potentials. In these models, variational inference approaches that exploit exact model symmetries are often forced to ground the entire problem, while methods that exploit approximate symmetries (such as by constructing an over-symmetric ...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملGeneralized Counting for Lifted Variable Elimination
Lifted probabilistic inference methods exploit symmetries in the structure of probabilistic models to perform inference more efficiently. In lifted variable elimination, the symmetry among a group of interchangeable random variables is captured by counting formulas, and exploited by operations that handle such formulas. In this paper we generalize the structure of counting formulas and present ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2013
ISSN: 0196-8858
DOI: 10.1016/j.aam.2013.01.005